G-complete Reducibility in Non-connected Groups
نویسندگان
چکیده
In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving connected groups, such as checking whether a certain subgroup of G is G-cr. This essentially reduces the problem of determining G-complete reducibility to the connected case.
منابع مشابه
2 9 Fe b 20 08 COMPLETE REDUCIBILITY AND COMMUTING SUBGROUPS
Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p ≥ 0. We study J-P. Serre's notion of G-complete reducibility for subgroups of G. Specifically, for a subgroup H and a normal subgroup N of H, we look at the relationship between G-complete reducibility of N and of H, and show that these properties are equivalent if H/N is linearly reductive, gener...
متن کاملSe p 20 06 COMPLETE REDUCIBILITY AND COMMUTING SUBGROUPS
Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p ≥ 0. We study J.-P. Serre's notion of G-complete reducibility for subgroups of G. In particular, for a subgroup H and a normal subgroup N of H, we look at the relationship between G-complete reducibility of N and of H, and show that these properties are equivalent if H/N is linearly reductive, gen...
متن کامل1 0 Ju l 2 00 7 COMPLETE REDUCIBILITY AND COMMUTING SUBGROUPS
Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p ≥ 0. We study J-P. Serre's notion of G-complete reducibility for subgroups of G. Specifically, for a subgroup H and a normal subgroup N of H, we look at the relationship between G-complete reducibility of N and of H, and show that these properties are equivalent if H/N is linearly reductive, gener...
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملComplete Reducibility and Separability
Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the interaction between the notion of separability and Serre’s concept of Gcomplete reducibility for subgroups of G. A separability hypothesis appears in many general th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013